搜索资源列表
学习知识库2.0版
- 学习知识库2.0版.rar C#知识库是我在学习C#时积累的一些知识。 本软件用C#编写,运行需要Microsoft .NET框架支持。 打开树状节点,双击可查看知识。-learning knowledge base version 2.0. Rar C# knowledge base is in learning C# gained some knowledge. The software prepared with C#, running Microsoft.NET framew
图论算法库 C++ 语言实现
- 图论算法库 C++ 语言实现 代码内容 图论算法库,包括以下算法: 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写,在VisualAge C++ 4.0下调试通过。压
《哈夫曼树》
- 根据哈夫曼算法创建的哈夫曼树,求树中每个外部结点的编码-under Huffman algorithm to create the Huffman tree for each tree node external coding
bin-tree
- 二叉树类及其实现以二叉链表为存储结构实现二叉树类和成员函数, 设计计算二叉树结点、将二叉树每个结点的左右子树交换、求二叉树高度的算法-Binary tree class and its implementation to the list for the storage structure of the binary classes and member functions to achieve a binary tree, binary tree node design calculati
tree
- 遍历树,用于存储节点信息及其他查找树操作,仅供学习参考-Traverse the tree, for storing information and other search tree node operation, only to learn information
delete-AVL-tree
- 武汉大学的数据结构C++版实验,要求实现AVL树结点删除-Wuhan University' s version of C++ data structure experiments required to achieve AVL tree node to delete
binary-tree
- 该文件描述了二叉树的链式存储结构。 相关性质。结点和结点间关系的基本概念;二叉树的链式存储结构。了解树的结点访问的方法。掌握二叉树的链式存储结构; 二叉树结点的递归访问方法。二叉树的遍历。二叉树的线索化及其应用 -The document describes the Storage Structure of the binary tree. Related properties. Nodes and nodes of the basic concepts of the relat
binary-tree
- 二叉树的创建,二叉树中结点的查找,测二叉树的深度宽度,输出二叉树的叶子结点-Binary tree creating, search binary tree node , the binary tree s depth and width, output binary tree leaf nodes
binary-tree
- 建立了一个二叉树,写出二叉树的结点,然后用前序历遍、中序历遍、后序历遍来访问了整棵二叉树。-A binary tree, write a binary tree node, and then use the pre-order the calendar over the calendar times in sequence, after the sequence to access the calendar over the whole grain binary tree.
tree
- ext中树形图的展示,以及点击子树节点生成一个窗口-ext tree map display, and click on the sub-tree node generates a window
adt-tree
- 二叉排序树:又称二叉查找树。 它或者是一棵空树;或者是具有下列性质的二叉树: (1)若左子树不空,则左子树上所有结点的值均小于它的根结点的值; (2)若右子树不空,则右子树上所有结点的值均大于它的根结点的值; (3)左、右子树也分别为二叉排序树;-Binary sort tree: also known as binary search tree. Or an empty tree or a binary tree with the following properties: (1) If t
tree
- 树形类js,可以自动拖拽树节点,挂接到其它节点的下方-drag tree node into another node
TBinary-tree
- 统计二叉树节点的C语言描述,软件技术基础,适用于初学者。-C language descr iption of statistical binary tree node, software technology base, suitable for beginners.
TREE
- 求解二叉树见节点的最大距离,供大家学习参考-Solving the binary tree node see the maximum distance for everyone to learn! ! ! ! ! !
AVL-Tree
- AVL tree - is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one
binary-tree
- 用二叉链表存储二叉树,用“扩张先序遍历序列”创建二叉链表,对二叉树进行前、中、后序的遍历以及层次遍历,输出度为0、1、2的节点及节点数,线索化二叉树,根据线索化的二叉树查找二叉树中任意节点的前驱、后继,通过线索二叉树进行二叉树节点的删除、插入,以及按树状打印二叉树。-Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, th
tree
- 编写一个算法程序实现: 1、建立一棵6个结点的二叉树,结点的数据值是正整数,并按中序输出之; 2、完成对以上二叉树中所有结点的左、右子树相互交换,并按中序输出交换以后的结果。 3、统计二叉树叶子结点的个数,并输出结果。 -Write an algorithm Program: 1. Establish a tree node 6 binary data value node is a positive integer, the output of the press in ord
tree-to-indented-text
- 算法实现了用缩格的文本形式表示任一树的节点数据的功能,代码简洁优化,含说明文档。-Algorithm functions with text indentation represents any tree node data, concise code optimization, including documentation.
tree
- 两棵树之间拖拽 ,实现树节点之间的拖拽 ,两棵树之间的拖拽 树节点刷新-Drag and drop between two trees, the realization of drag and drop between tree node, drag and drop between two trees refresh the tree node
tree
- 快速生成树,遍历树节点,性能优,快速,可靠(Rapid spanning tree traversal tree node, performance is superior, fast and reliable)